A Study on Disseminating Dependent Information in Wireless Broadcast Environments

Data broadcasting is an effective approach to disseminate public information to mobile clients in wireless mobile environments. In some applications, the access pattern of all the data can be represented by a weighted DAG. In this paper, we explore how the server generates the broadcast schedule, for the data set having a DAG access pattern, which not only minimizes the access latency but also is a topological ordering of the DAG. We prove that it is NP-hard to find an optimal broadcast schedule and provide two heuristics. After giving an analysis for these two heuristics on the latency and complexity, we implement the proposed heuristics to compare their performance.